Distributed Primality Proving and the Primality of (23539+1)/3
نویسنده
چکیده
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
منابع مشابه
Elliptic Curves, Primality Proving and Some Titanic Primes
We describe how to generate large primes using the primality proving algorithm of Atkin. Figure 1: The Titanic .
متن کاملFour primality testing algorithms
Four primality testing algorithms Introduction. In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time algorithm to prove that a given numer is either prime or composite. The third and fourth primality tests are...
متن کاملImproving the Speed and Accuracy of the Miller-Rabin Primality Test
Currently, even the fastest deterministic primality tests run slowly, with the AgrawalKayal-Saxena (AKS) Primality Test runtime Õ(log(n)), and probabilistic primality tests such as the Fermat and Miller-Rabin Primality Tests are still prone to false results. In this paper, we discuss the accuracy of the Miller-Rabin Primality Test and the number of nonwitnesses for a composite odd integer n. We...
متن کاملImproved Primality Proving with Eisenstein Pseudocubes
In August 2002, Agrawal, Kayal, and Saxena described an unconditional, deterministic algorithm for proving the primality of an integer N . Though of immense theoretical interest, their technique, even incorporating the many improvements that have been proposed since its publication, remains somewhat slow for practical application. This paper describes a new, highly efficient method for certifyi...
متن کاملFast Primality Proving on Cullen Numbers
We present a unconditional deterministic primality proving algorithm for Cullen numbers. The expected running time and the worst case running time of the algorithm are Õ(logN) bit operations and Õ(logN) bit operations, respectively.
متن کامل